Data-based Node Penalties in a Path-finding Algorithm in an Automated Material Handling System
نویسندگان
چکیده
Increasing factory throughput is a critical issue in the semiconductor industry, and a quick transition of material to the next location in the automation system plays a significant role in increasing throughput. A dynamic pathfinding algorithm for a vehicle-based automated material handling system (AMHS) is discussed in this paper. The dynamic path-finding algorithm uses distance between nodes, node penalties, and the number of vehicles queued to calculate the total cost of a path. This paper introduces the use of historical data from the AMHS and discusses how to effectively utilize such data in critical situations to improve overall AMHS performance.
منابع مشابه
Two optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملContour Crafting Process Plan Optimization Part I: Single-Nozzle Case
Contour Crafting is an emerging technology that uses robotics to construct free form building structures by repeatedly laying down layers of material such as concrete. The Contour Crafting technology scales up automated additive fabrication from building small industrial parts to constructing buildings. Tool path planning and optimization for Contour Crafting benefit the technology by increasin...
متن کاملEnergy optimization based on routing protocols in wireless sensor network
Considering the great significant role that routing protocols play in transfer rate and choosing the optimum path for exchange of data packages, and further in the amount of consumed energy in the routing protocol, the present study has focused on developing an efficient compound energy algorithm based on cluster structure which is called active node with cluster structure. The purpose of this ...
متن کاملA Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملContour Crafting Process Plan Optimization Part II: Multi–Machine Cases
Contour Crafting is an emerging technology that uses robotics to construct free form building structures by repeatedly laying down layers of material such as concrete. The Contour Crafting technology scales up automated additive fabrication from building small industrial parts to constructing buildings. Tool path planning and optimization for Contour Crafting benefit the technology by increasin...
متن کامل